Speeding up all-against-all protein comparisons while maintaining sensitivity by considering subsequence-level homology

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding up all-against-all protein comparisons while maintaining sensitivity by considering subsequence-level homology

Orthology inference and other sequence analyses across multiple genomes typically start by performing exhaustive pairwise sequence comparisons, a process referred to as "all-against-all". As this process scales quadratically in terms of the number of sequences analysed, this step can become a bottleneck, thus limiting the number of genomes that can be simultaneously analysed. Here, we explored ...

متن کامل

Speeding Up All-Pairwise Dynamic Time Warping Matrix Calculation

Dynamic Time Warping (DTW) is certainly the most relevant distance for time series analysis. However, its quadratic time complexity may hamper its use, mainly in the analysis of large time series data. All the recent advances in speeding up the exact DTW calculation are confined to similarity search. However, there is a significant number of important algorithms including clustering and classif...

متن کامل

Speeding Up Dijkstra ’ s Algorithm for All Pairs Shortest Paths ∗

We present a technique for reducing the number of edge scans performed by Dijkstra’s algorithm for computing all pairs shortest paths. The main idea is to restrict path scanning only to locally shortest paths, i.e., paths whose proper subpaths are shortest paths. On a directed graph with n vertices and m edges, the technique we discuss allows it to reduce the number of edge scans from O(mn) to ...

متن کامل

All - Against - All Sequence

In this paper we present an algorithm which attempts to align pairs of subsequences from a database of DNA sequences. The algorithm simulates the classical dynamic programming alignment algorithm over a digital index of the database. The running time of the algorithm is subquadratic on average with respect to the database size. A similar algorithm solves the approximate string matching problem ...

متن کامل

All tanked up

the meatiest bodies. These are the high-producing animals that have the most endemic welfare problems anyway. " In other words, the very real animal welfare concerns aren't specific to cloning at all. Of course, since many people just think cloning sounds gross, one easy way out is to label meat as cloned or not cloned. The FDA said it wouldn't prevent companies from marketing their meat as clo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PeerJ

سال: 2014

ISSN: 2167-8359

DOI: 10.7717/peerj.607